Energy-aware and secure routing with trust levels for wireless ad hoc and sensor networks

This dissertation focuses on the development of routing algorithms for secure and trusted routing in wireless ad hoc and sensor network. The first paper presents the Trust Level Routing (TLR) protocol, an extension of the optimized energy-delay routing (OEDR) protocol, focusing on the integrity, reliability and survivability of the wireless network...The second paper analyzes both OLSR and TLR in terms of survivability and reliability to emphasize the improved performance of the network in terms of lifetime and proper delivery of data...The third paper proposes a statistical reputation model that uses the watchdog mechanism to observe the cooperation of the neighboring nodes...The last paper presents the results of the hardware implementation of Energy-Efficient Hybrid Key Management --Abstract, page iv

On the Improper Use of CRC for Cryptographic Purposes in RFID Mutual Authentication Protocols

Mutual authentication is essential to guarantee the confidentiality, integrity, and availability of an RFID system. One area of interest is the design of lightweight mutual authentication protocols that meet the limited computational and energy resources of the tags. These protocols use simple operations such as permutation and cyclic redundancy code for cryptographic purposes. However, these functions are cryptographically weak and are easily broken. In this work, we present a case against the use of these functions for cryptographic purposes, due to their simplicity and linear properties, by analyzing the LPCP protocol. We evaluate the claims of the LPCP resistance to de-synchronization and full disclosure attacks and show that the protocol is weak and can be easily broken by eavesdropping on a few mutual authentication sessions. This  weakness stems from the functions themselves as well as the improper use of inputs to these functions. We further offer suggestions that would help in designing more secure protocols

Optimal Energy-Delay Routing Protocol with Trust Levels for Wireless Ad Hoc Networks

This paper presents the Trust Level Routing (TLR) pro- tocol, an extension of the optimized energy-delay rout- ing (OEDR) protocol, focusing on the integrity, reliability and survivability of the wireless network. TLR is similar to OEDR in that they both are link state routing proto- cols that run in a proactive mode and adopt the concept of multi-point relay (MPR) nodes. However, TLR aims at incorporating trust levels into routing by frequently changing the MPR nodes as well as authenticating the source node and contents of control packets. TLR calcu- lates the link costs based on a composite metric (delay incurred, energy available at the neighbor node, energy spent during transmission and the number of packets sent on each link) for the selection ofMPR nodes. We highlight the vulnerabilities in OEDR and show ways to counter the possible attacks by using authentication and traffic par- tition as a basis for mitigating the effects of malicious activity. Network simulator NS2 results show that TLR delivers the packets with a noticeable decrease in the av- erage end-to-end delay with a small increase in the power consumed due to the additional computational overhead attributed to the security extension

Tag Ownership Transfer in Radio Frequency Identification Systems: A Survey of Existing Protocols and Open Challenges

Radio frequency identification (RFID) is a modern approach to identify and track several assets at once in a supply chain environment. In many RFID applications, tagged items are frequently transferred from one owner to another. Thus, there is a need for secure ownership transfer (OT) protocols that can perform the transfer while, at the same time, protect the privacy of owners. Several protocols have been proposed in an attempt to fulfill this requirement. In this paper, we provide a comprehensive and systematic review of the RFID OT protocols that appeared over the years of 2005-2018. In addition, we compare these protocols based on the security goals which involve their support of OT properties and their resistance to attacks. From the presented comparison, we draw attention to the open issues in this field and provide suggestions for the direction that future research should follow. Furthermore, we suggest a set of guidelines to be considered in the design of new protocols. To the best of our knowledge, this is the first comprehensive survey that reviews the available OT protocols from the early start up to the current state of the art

Ultra-Lightweight Mutual Authentication Protocol with Substitution Operation

A method comprises using at least one of a reader and a passive tag to exchange values according to an ultra-lightweight mutual authentication protocol with a substitution operation to change a Hamming weight of the values

Network performance comparison: Simulated and actual results

“Network simulation is a major step in network planning. Various commercial packages provide useful predictions about the network performance and allow designers to obtain optimal performance by evaluating different modifications. COMNET III is a graphical, off-the shelf simulation tool which is used to analyze the performance of a computer network. In this study, COMNET III will be tested by comparing the results it produces with actual results obtained using a test network in the lab. A network analysis package, Observer 7.1 ®, will be used for gathering statistics about the test network. Observer produces reports about network performance by capturing the packets flowing throughout the network. Bandwidth utilization of the segment, error statistics, and information about stations with the largest traffic are some examples of Observer reports. The goal of this study is to verify that the simulation package produces results that are relatively close to the actual results”--Abstract, page iii

OPTIMAL ENERGY-DELAY ROUTING PROTOCOL WITH TRUST LEVELS FOR WIRELESS AD HOC NETWORKS

ITC/USA 2005 Conference Proceedings / The Forty-First Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2005 / Riviera Hotel & Convention Center, Las Vegas, NevadaAn ad hoc network is a group of wireless nodes which do not rely on any fixed infrastructure. Hosts cooperate by forwarding packets for each other to communicate with nodes that are out of the radio transmission range. We propose a new routing algorithm that is based on the concept of multipoint relay nodes (MPR). The main focus of the Trust Level Routing protocol is the reliability and survivability of the network by applying costs to each MPR candidate. The cost calculation is based on the delay incurred, energy available at the MPR node, energy spent during transmission and number of packets sent on each link. We highlight the vulnerabilities in current link state routing algorithms and propose the use of light weight encryption algorithms to achieve a dependable routing algorithm. Network simulator (ns-2) is used to compare the protocol performance to other existing link state routing protocols.International Foundation for TelemeteringProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection

SURVIVABILITY AND RELIABILITY ANALYSIS OF THE TRUSTED LINK STATE ROUTING PROTOCOL FOR WIRELESS AD HOC NETWORKS

ABSTRAC

An Efficient Path Generation Algorithm Using Principle Component Analysis for Mobile Sinks in Wireless Sensor Networks

Recently, the data collection problem in wireless sensor networks (WSNs) using mobile sinks has received much attention. The main challenge in such problems is constructing the path that the mobile sink (MS) will use to collect the data. In this paper, an efficient path generation algorithm for the mobile sink based on principal component analysis (PCA) is proposed. The proposed approach was evaluated using two data collection modes—direct and multihop—and it was compared with another approach called the mobile-sink-based energy-efficient clustering algorithm for wireless sensor networks (MECA). When compared with MECA, simulation results have shown that the proposed approach improves the performance of WSN in terms of the number of live nodes and average remaining energy